Specker Challenge Game: Requirements & Design From Generic to CNF/CSP Versions
نویسندگان
چکیده
Since 2006 we have been working on a game, called the Specker Challenge Game (SCG), both for our teaching and to push our research in programming tools. Consider yourself moved back a few hundred years to the time of the Renaissance in Italy. The mathematicians challenged each other regarding the best algorithms to solve problems. Here is a story about who was the best in solving cubic equations in the 16th century. 1
منابع مشابه
Specker Challenge Game: Mechanism Design for Algorithm Innovation and Evaluation
How can we drive innovation towards better algorithms for NP optimization problems? NPO is the class of all NP optimization problems. The ingredients to an optimization problem are the set of input instances or problems, the set of feasible solutions, and the measure defined for a feasible solution. In a nutshell, NPO problems are optimization problems whose feasible solutions are short and eas...
متن کاملQBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency
Quantified Boolean Formulas (QBFs) present the next big challenge for automated propositional reasoning. Not surprisingly, most of the present day QBF solvers are extensions of successful propositional satisfiability algorithms (SAT solvers). They directly integrate the lessons learned from SAT research, thus avoiding re-inventing the wheel. In particular, they use the standard conjunctive norm...
متن کاملThe Specker Challenge Game for Education and Innovation in Constructive Domains
We have the following vision: To teach a constructive domain (e.g., domain in computer science, mathematics, engineering, etc.), we design a domain-specific game where the winning students demonstrate superior domain knowledge. The game is simple: the students make constructive claims about the domain we want to teach and refute each others’ claims. The students who are the most successful in d...
متن کاملFPTAS for Counting Monotone CNF
A monotone CNF formula is a Boolean formula in conjunctive normal form where each variable appears positively. We design a deterministic fully polynomial-time approximation scheme (FPTAS) for counting the number of satisfying assignments for a given monotone CNF formula when each variable appears in at most 5 clauses. Equivalently, this is also an FPTAS for counting set covers where each set co...
متن کاملBinary Constraint System Games and Locally Commutative Reductions
A binary constraint system game is a two-player one-round non-local game defined by a system of Boolean constraints. The game has a perfect quantum strategy if and only if the constraint system has a quantum satisfying assignment [15]. We show that several concepts including the quantum chromatic number and the Kochen-Specker sets that arose from different contexts fit naturally in the binary c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009